A Modified transmission Algorithm for Resolving Vehicle Routing Problem by Intelligent Water drop Algorithm

A comparison between two technologies „Swarm Intelligence‟ and „Intelligent Water drops‟ inorder to overcome the disadvantages of various technologies is an integral concern of this paper . It is nature inspired. IWD algorithm is used to calculate the solutions of the n-queen puzzle with a simple local heuristic. Water of the ocean river easily finds best way from the number of various ways available to reach from its starting to end point. The water drops that flows in rivers has optimal paths that have been obtained by the actions and reactions. With the help of modified IWD algorithm the traveling of salesman problem has also solved. So it is considered as NP-hard Polynomial.NP-hard (Nondeterministic Polynomial-time hard) is a class of problems that are informally,” at least as hard as the hardest problems in NP”. IWD is a fastest algorithm. It provides the minimum distance among the all options. Due to the collaboration of SI and IWD, this algorithm is more efficient. It includes the properties of both SI and IWD. This paper proposes IWD techniques to solve VRP.